A sliding window protocol is of the size ( n - 1 ). How many
A sliding window protocol is of the size ( n - 1 ). How many maximum packets can be sent without acknowledgement ?
A0
B( n - 1 )
Cn
D( n + 1 )
